Robust transshipment problem under consistent flow constraints

Abstract In this article, we study robust transshipment under consistent flow constraints. We consider demand uncertainty represented by a finite set of scenarios and characterize subset arcs as so‐called fixed arcs. each scenario, require an integral that satisfies the respective balance addition, on arc, equal for all scenarios. The objective is to minimize maximum cost occurring among show problem strongly ‐complete acyclic digraphs reduction from ‐ Sat problem. Furthermore, prove weakly series‐parallel special case Partition If in addition number constant, observe pseudo‐polynomial‐time solvability provide poly‐nomial‐time algorithms three cases digraphs. Finally, present polynomial‐time algorithm pearl